Probabilistic Reversible Automata and Quantum Automata
نویسندگان
چکیده
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
منابع مشابه
Novel Design of n-bit Controllable Inverter by Quantum-dot Cellular Automata
Application of quantum-dot is a promising technology for implementing digital systems at nano-scale. Quantum-dot Cellular Automata (QCA) is a system with low power consumption and a potentially high density and regularity. Also, QCA supports the new devices with nanotechnology architecture. This technique works </...
متن کاملQuantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
We study the recognition of R-trivial idempotent (R1) languages by various models of ”decide-and-halt” quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak’s enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characteriz...
متن کاملOn a class of languages recognizable by probabilistic reversible decide-and-halt automata
We analyze the properties of probabilistic reversible decide-and-halt automata (DHPRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DHPRA by proving that two ‘‘forbidden’’ constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملArtin's Conjecture and Size of Finite Probabilistic Automata
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. The result is presented in two versions. The first version depends on Artin’s Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versi...
متن کامل